Modeling Security-Check Queues

نویسندگان

  • Zhe George Zhang
  • Hsing Paul Luh
  • Chia-Hung Wang
چکیده

Motivated by the waiting lines between the US-Canadian border-crossings, we investigate a security-check system with both security and customer service goals. In such a system, every customer has to be inspected by the first stage inspector but only a proportion of customers need to go through the second stage for further inspection. This "further inspection proportion", affecting both security screening and the system congestion, becomes a key decision variable for the security-check system. Using a stylized two-stage queueing model, we established the convexity of the expected waiting cost function. With such a property, the optimal further inspection proportion can be determined to achieve the balance of the two goals and the service capacities can be classified into "security-favorable", "security-unfavorable" or "security-infeasible" categories. A specific capacity category implies if the security and customer service goals are consistent or in conflict. In addition, we have verified that the properties discovered in the stylized model also hold approximately in a more general multi-server setting. Numerical results are presented to demonstrate the accuracy and robustness of the approximations and the practical value of the model. *This is a joint work with P.H. Luh and C. Wang of National Chengchi University, Taipei, Taiwan.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Airport Check-In Optimization by IP and Simulation in Combination

The check-in area of airport terminal is one of the busiest sections at airports at certain periods. The passengers are subjected to queues and delays during the check-in process. These delays and queues are due to constraints in the capacity of service facilities. In this project, the airport terminal is decomposed into several check-in areas. The airport check-in scheduling problem requires b...

متن کامل

Dynamic Server Allocation at Parallel Queues

We explore whether dynamically reassigning servers to parallel queues in response to queue imbalances can reduce average waiting time in those queues. We use approximate dynamic programming methods to determine when servers should be switched, and we compare the performance of such dynamic allocations to that of a pre-scheduled deterministic allocation. Testing our method on both synthetic data...

متن کامل

Practical Memory Checkers for Stacks, Queues and Deques

A memory checker for a data structure provides a method to check that the output of the data structure operations is consistent with the input even if the data is stored on some insecure medium. In 8] we present a general solution for all data structures that are based on insert(i; v) and delete(j) commands. In particular this includes stacks, queues, deques (double-ended queues) and lists. Her...

متن کامل

Checking Mergeable Priority Queues

We present an eecient algorithm which can check the answers given by the fundamental abstract data types priority queues and mergeable priority queues. This is the rst linear-time checker for mergeable priority queues. These abstract data types are widely used in routing, scheduling, simulation, computational geometry and many other algorithmic domains. We have implemented our answer checker an...

متن کامل

Modeling and Validating the Clinical Information Systems Policy Using Alloy

Information systems security defines three properties of information: confidentiality, integrity, and availability. These characteristics remain major concerns throughout the commercial and military industry. In this work, we focus on the integrity aspect of commercial security applications by exploring the nature and scope of the famous integrity policy the Clinical Information Systems Policy....

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Management Science

دوره 57  شماره 

صفحات  -

تاریخ انتشار 2011